A generalized greedy routing algorithm for 2-connected graphs
نویسندگان
چکیده
منابع مشابه
A greedy approximation algorithm for the minimum (2, 2)-connected dominating set problem
Using a connected dominating set (CDS) to serve as the virtual backbone of a wireless sensor network (WSN) is an effective way to save energy and reduce the impact of broadcasting storms. Since nodes may fail due to accidental damage or energy depletion, it is desirable that the virtual backbone is fault tolerant. This could be modeled as a k-connected, m-fold dominating set ((k,m)-CDS). Given ...
متن کاملGeneralized Greedy Algorithm for Shortest Superstring
In the primitive greedy algorithm for shortest superstring, if a pair of strings with maximum overlap picked out, they are subsequently merged. In this paper, we introduce the concept of optimal set and generalize the primitive greedy algorithm. The generalized algorithm can be reduced to the primitive greedy algorithm if the relative optimal set is empty. Consequently, the new algorithm achiev...
متن کاملA general greedy channel routing algorithm
Abstmt-This paper presents a new channel routing algorithm which assigns wires track by track in a greedy way. The simple underlying data structures and strategy used in this algorithm can be generalized to obtain a class of heuristic channel routing algorithms. The proposed new algorithm has a backtracking capability to increase the chance of completing the routing with a minimum number of tra...
متن کاملOn Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
A greedy embedding of a graph G = (V, E) into a metric space (X, d) is a function x : V (G) → X such that in the embedding for every pair of non-adjacent vertices x(s), x(t) there exists another vertex x(u) adjacent to x(s) which is closer to x(t) than x(s). This notion of greedy embedding was defined by Papadimitriou and Ratajczak (Theor. Comput. Sci. 2005), where authors conjectured that ever...
متن کاملAlgorithm for two disjoint long paths in 2-connected graphs
Denote by σ̄k = min {d(x1)+d(x2)+ · · ·+d(xk)−|N(x1)∩N(x2)∩· · ·∩N(xk)| | x1, x2, · · · , xk are k independent vertices in G}. Let n and m denote the number of vertices and edges of G. For any connected graph G, we give a polynomial algorithm in O(nm) time to either find two disjoint paths P1 and P2 such that |P1|+ |P2| ≥ min{σ̄4, n} or output G = ∪i=1Gi such that for any i, j ∈ {1, 2, ..., k} (k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.08.032